DE eng

Search in the Catalogues and Directories

Page: 1 2 3 4 5...72
Hits 1 – 20 of 1.423

1
Characterizing News Portrayal of Civil Unrest in Hong Kong, 1998–2020 ...
BASE
Show details
2
Jibes & Delights: A Dataset of Targeted Insults and Compliments to Tackle Online Abuse​ ...
BASE
Show details
3
Bird’s Eye: Probing for Linguistic Graph Structures with a Simple Information-Theoretic Approach ...
BASE
Show details
4
Dependency Patterns of Complex Sentences and Semantic Disambiguation for Abstract Meaning Representation Parsing ...
BASE
Show details
5
Phrase-Level Action Reinforcement Learning for Neural Dialog Response Generation ...
BASE
Show details
6
10D: Phonology, Morphology and Word Segmentation #1 ...
BASE
Show details
7
Sample-efficient Linguistic Generalizations through Program Synthesis: Experiments with Phonology Problems ...
BASE
Show details
8
PHMOSpell: Phonological and Morphological Knowledge Guided Chinese Spelling Check ...
BASE
Show details
9
19th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology - Part 2 ...
BASE
Show details
10
18th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology - Part 1 ...
BASE
Show details
11
The Match-Extend Serialization Algorithm in Multiprecedence ...
BASE
Show details
12
Recognizing Reduplicated Forms: Finite-State Buffered Machines ...
Abstract: Total reduplication is common in natural language phonology and morphology. However, formally as copying on reduplicants of unbounded size, unrestricted total reduplication requires computational power beyond context-free, while other phonological and morphological patterns are regular, or even sub-regular. Thus, existing language classes characterizing reduplicated strings inevitably include typologically unattested context-free patterns, such as reversals. This paper extends regular languages to incorporate reduplication by introducing a new computational device: finite state buffered machine (FSBMs). We give its mathematical definitions and discuss some closure properties of the corresponding set of languages. As a result, the class of regular languages and languages derived from them through a copying mechanism is characterized. Suggested by previous literature, this class of languages should approach the characterization of natural language word sets. ...
Keyword: Computational Linguistics; Condensed Matter Physics; Electromagnetism; FOS Physical sciences; Information and Knowledge Engineering; Neural Network; Semantics
URL: https://dx.doi.org/10.48448/94rx-t487
https://underline.io/lecture/30083-recognizing-reduplicated-forms-finite-state-buffered-machines
BASE
Hide details
13
Correcting Chinese Spelling Errors with Phonetic Pre-training ...
BASE
Show details
14
PLOME: Pre-training with Misspelled Knowledge for Chinese Spelling Correction ...
BASE
Show details
15
Including Signed Languages in Natural Language Processing ...
BASE
Show details
16
When is Char Better Than Subword: A Systematic Study of Segmentation Algorithms for Neural Machine Translation ...
BASE
Show details
17
The Reading Machine: a Versatile Framework for Studying Incremental Parsing Strategies ...
BASE
Show details
18
To POS Tag or Not to POS Tag: The Impact of POS Tags on Morphological Learning in Low-Resource Settings ...
BASE
Show details
19
An FST morphological analyzer for the Gitksan language ...
BASE
Show details
20
Superbizarre Is Not Superb: Derivational Morphology Improves BERT's Interpretation of Complex Words ...
BASE
Show details

Page: 1 2 3 4 5...72

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
1.423
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern